A two-stage stochastic model for the winner determination problem in transportation procurement auctions
نویسندگان
چکیده
We propose a service-oriented combinatorial auction mechanism in an uncertain context where a shipper needs to outsource its transport operations to external carriers. Uncertainty is on shipper demand, carrier capacity and carrier lead time. A two-stage stochastic formulation is proposed to model the winner determination problem. A Monte Carlo approach combined with the sample average approximation method is proposed to solve the problem. Our preliminary results prove the efficiency and the relevance of the proposed approach.
منابع مشابه
Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملGRASP with Hybrid Path Relinking for Bi-Objective Winner Determination in Combinatorial Transportation Auctions
The procurement of transportation services via large-scale combinatorial auctions involves a couple of complex decisions whose outcome highly influences the performance of the tender process. This paper examines the shipper’s task of selecting a subset of the submitted bids which efficiently trades off total procurement cost against expected carrier performance. To solve this bi-objective winne...
متن کاملA Robust Winner Determination Problem for Combinatorial Transportation Auctions under Uncertain Shipment Volumes
Combinatorial auctions are widely used for the procurement of transportation services. In these auctions, shippers act as auctioneers who need to outsource a number of transportation services to external carriers. Carriers compete by submitting bids on packages of shippers' requests. After receiving all carriers' bids, the shipper solves the well-known winner determination problem (WDP) in orde...
متن کاملAn improved Ant Colony Algorithm for Optimal Winner Determination Problem in Reverse Combinatorial Auction
Reverse Combinatorial auctions, that is, auctions where bidders can bid on the supply right of combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-item auctions where the agents' valuations of the items are not additive. A common model is formulated for optimal the winner determination problem of reverse combinatorial auction. A PRIM (P...
متن کاملA Genetic Algorithm for a Bi-Objective Winner-Determination Problem in a Transportation-Procurement Auction
This paper introduces a bi-objective winner-determination problem and presents a multiobjective genetic algorithm to solve it. The problem examined arises in the procurement of transportation contracts via combinatorial auctions. It is modeled as an extension to the set-covering problem and considers the minimization of the total procurement costs and the maximization of the service-quality lev...
متن کامل